منابع مشابه
Gossip-based Peer Sampling in Social Overlays
Performance of many P2P systems depends on the ability to construct a random overlay network among the nodes. Current state-of-the-art techniques for constructing random overlays have an implicit requirement that any two nodes in the system should always be able to communicate and establish a link between them. However, this is not the case in some of the environments where distributed systems ...
متن کاملGossip-Based Reputation Management for Unstructured Peer-to-Peer Networks*
To build an efficient reputation system for peer-to-peer (P2P) networks, we need fast mechanisms to aggregate peer evaluations and to disseminate updated scores to a large number of peer nodes. Unfortunately, unstructured P2P networks are short of secure hashing and fast lookup mechanisms as in structured P2P systems like the DHT-based Chord. In light of this shortcoming, we propose a gossiping...
متن کاملGossip-based distribution estimation in peer-to-peer networks
We propose a novel gossip-based technique that allows each node in a system to estimate the distribution of values held by other nodes. We observe that the presence of duplicate values does not significantly affect the distribution of values in samples collected through gossip, and based on that explore different data synopsis techniques that optimize space and time while allowing nodes to accu...
متن کاملPeer-to-Peer Membership Management for Gossip-Based Protocols
Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. The requirement of global knowledge impairs their applicability to very large-scale groups. In this paper, we pres...
متن کاملGossip-based Search Selection in Hybrid Peer-to-Peer Networks
We present GAB, a search algorithm for hybrid P2P networks, that is, networks that search using both flooding and a DHT. GAB uses a gossip-style algorithm to collect global statistics about document popularity to allow each peer to make intelligent decisions about which search style to use for a given query. Moreover, GAB automatically adapts to changes in the operating environment. Synthetic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 2007
ISSN: 0734-2071,1557-7333
DOI: 10.1145/1275517.1275520